The algebra of binary trees is affine complete

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto elements. We show that the binary trees whose leaves are labeled by letters alphabet containing at least three letters, a if and only polynomial.